Effects of the Different Migration Periods on Parallel Multi-swarm Pso
نویسندگان
چکیده
In recent years, there has been an increasing interest in parallel computing. In parallel computing, multiple computing resources are used simultaneously in solving a problem. There are multiple processors that will work concurrently and the program is divided into different tasks to be simultaneously solved. Recently, a considerable literature has grown up around the theme of metaheuristic algorithms. Particle swarm optimization (PSO) algorithm is a popular metaheuristic algorithm. The parallel comprehensive learning particle swarm optimization (PCLPSO) algorithm based on PSO has multiple swarms based on the master-slave paradigm and works cooperatively and concurrently. The migration period is an important parameter in PCLPSO and affects the efficiency of the algorithm. We used the well-known benchmark functions in the experiments and analysed the performance of PCLPSO using different migration periods.
منابع مشابه
Parallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملSynchronous and Asynchronous Communication Modes for Swarm Robotic Search
Swarm robots are special multi-robots and usually considered being controlled with swarm intelligence-basedmethod to complete some assigned complex tasks (Dorigo and Sahin, 2004). Similar to the biological counterparts in nature, swarm intelligence among such artificial system is emerged from local interactions between individual robots or individual robot and its environment (Beni, 2005; Şahin...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملParallel Multi-Swarm PSO Based on K-Medoids and Uniform Design
PAM (Partitioning around Medoid) is introduced to divide the swarm into several different subpopulations. PAM is one of k-medoids clustering algorithms based on partitioning methods. It attempts to divide n objects into k partitions. This algorithm overcomes the drawbacks of being sensitive to the initial partitions in kmeans algorithm. In the parallel PSO algorithms, the swarm needs to be divi...
متن کاملMulti-swarm PSO algorithm for the Quadratic Assignment Problem: a massively parallel implementation on the OpenCL platform
This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem 1 (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency 2 tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a 3 parallel execution platform can be fully exploited provided the processed population is large. The 4 described...
متن کامل